Optimal Mechanism Design with Speculation and Resale∗
نویسندگان
چکیده
In this paper, we examine the optimal mechanism design problem of selling an indivisible object to one regular buyer and one speculator, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully characterize the optimal mechanism under general conditions. Surprisingly, in the optimal mechanism, the seller never allocates the object to the regular buyer regardless of his bargaining power in the resale market. The seller sells only to the speculator, and reveals no additional information to the resale market. The possibility of resale causes the seller to sometimes hold back the object, which under our setup is never optimal if resale is prohibited. We find that the seller’s revenue is increasing in the speculator’s bargaining power in the resale market. When the speculator has full bargaining power, Myerson’s optimal revenue is achieved. When the speculator has no bargaining power, a conditional efficient mechanism prevails. Extension to the case of one speculator and many regular buyers is also discussed.
منابع مشابه
Speculation in Second-Price Auctions with Resale
This paper contributes to the literature on second-price auctions with resale. We add speculators—bidders with value zero—to the standard symmetric independent private values environment. There always exists a continuum of inefficient equilibria that are profitable for a speculator. With no reserve price in the initial auction, speculation can enhance the initial seller’s expected revenue. On t...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملRobustly Optimal Auctions with Unknown Resale Opportunities
The standard revenue-maximizing auction discriminates against a priori stronger bidders so as to reduce their information rents. We show that such discrimination is no longer optimal when the auctions winner may resell to another bidder, and the auctioneer has non-Bayesian uncertainty about such resale opportunities (including possible leakage of private information before resale). We consider...
متن کاملFirst-Price Auctions with Speculative Resale Part I: Equilibrium and Optimal Revenue
In this paper, we investigate the model of speculative resale in auctions. Resale (or secondary trade) is allowed for each bidder, but in equilibrium we show that there is only speculative resale. We consider a standard rst-price auction in the rst stage with symmetric independent private values (IPV) among N bidders and one speculator. In the second stage there is resale among the bidders. T...
متن کاملSpeculation in First-Price Auctions with Resale
We analyze first-price auctions with two asymmetric bidders, where the winner can offer the good for resale to the loser. One bidder has a private value for the good, the other bidder—the speculator—has zero value. We show that, independently of the resale market rules, the speculator’s expected profit equals zero. Nevertheless, the opportunity for resale can create a role for an active specula...
متن کامل